Synchronizing delay for binary uniform morphisms
نویسندگان
چکیده
Circular D0L-systems are those with finite synchronizing delay. We introduce a tool called graph of overhangs which can be used to find the minimal value of synchronizing delay of a given D0L-system. By studying the graphs of overhangs, a general upper bound on the minimal value of a synchronizing delay of a circular D0L-system with a binary uniform morphism is given.
منابع مشابه
On Morphisms Preserving Primitive Words
A word is called primitive if it cannot be expressed as the power of another word. Morphisms preserving primitive words are investigated. Similarly to the word case, each square-free morphism is a primitive morphism but the converse does not hold. A precise characterization of primitive morphisms is provided in terms of pure codes. An easily testable characterization is given for uniform morphi...
متن کاملOn permutation complexity of fixed points of some uniform binary morphisms
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملThere are k-uniform cubefree binary morphisms for all k >= 0
A word is cubefree if it contains no non-empty subword of the form xxx. A morphism h : Σ * → Σ * is k-uniform if h(a) has length k for all a ∈ Σ. A morphism is cubefree if it maps cubefree words to cubefree words. We show that for all k ≥ 0 there exists a k-uniform cubefree binary morphism.
متن کاملOn the Asymptotic Abelian Complexity of Morphic Words
The subword complexity of an infinite word counts the number of subwords of a given length, while the abelian complexity counts this number up to letter permutation. Although a lot of research has been done on the subword complexity of morphic words, i.e., words obtained as fixed points of iterated morphisms, little is known on their abelian complexity. In this paper, we undertake the classific...
متن کاملMathematical Optimization and the Synchronizing Properties of Encodings
Methods for constructing binary exhaustive prefix codes with certain synchronizing properties are given. In particular it is shown how to formulate the requirement that a code be anagrammatic and the requirement for minimal synchronizing delay as linear integer programming problems. The tree structure of the code is given and the program optimizes over all possible labelings of the tree. Severa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 615 شماره
صفحات -
تاریخ انتشار 2016